public class test {
    // 牛牛的快递
    import java.util.Scanner;
    // 注意类名必须为 Main, 不要有任何 package xxx 信息
    public class Main {
        public static void main(String[] args) {
            Scanner in = new Scanner(System.in);
            double num = in.nextDouble();
            char c = in.next().charAt(0);
            int price = 20;
//大于1kg,并且有多余不到1kg的部分
            if(num > 1.0 && num % 1.0 > 0){
                price += (num / 1);
            }else if(num > 1.0 && num % 1.0 == 0){
                price += (num / 1) - 1;
            }
            if(c == 'y'){
                price += 5;
            }S
            ystem.out.println(price);
        }
    }
    // 最小花费爬楼梯
    public class Main {
        public static void main(String[] args) {
            Scanner in = new Scanner(System.in);
            int n = in.nextInt();
            int[] costs = new int[n];
            for (int i = 0; i < n; i++) {
                costs[i] = in.nextInt();
            }
// 1. 创建 dp 表
//代表从0到第i个阶梯,所需要的最低花费
            int[] dp = new int[n + 1];
// 2. 初始化
            dp[0] = 0;
            dp[1] = 0;
// 3. 填表
            for (int i = 2; i <= n; i++) {
//从上一个或上两个位置开始,迈到现在的位置
                int n1 = dp[i - 1] + costs[i - 1];
                int n2 = dp[i - 2] + costs[i - 2];
                dp[i] = Math.min(n1, n2);
            }
// 4. 返回值
            System.out.println(dp[n]);
        }
    }
    // 数组中两个字符串的最小距离
    public class Main {
        public static void main(String[] args) {
            Scanner in = new Scanner(System.in);
// 注意 hasNext 和 hasNextLine 的区别
            int n = in.nextInt();
            String s1 = in.next();
            String s2 = in.next();
            int indexS1 = -1;
            int indexS2 = -1;
            int min = 100010;
            for(int i = 0;i < n;i++){
                String s = in.next();
                if(s.equals(s1)){
                    indexS1 = i;
                    if(indexS2 >= 0){
                        min = Math.min(min,Math.abs(indexS1 - indexS2));
                    }
                }else if(s.equals(s2)){
                    indexS2 = i;
                    if(indexS1 >= 0){
                        min = Math.min(min,Math.abs(indexS1 - indexS2));
                    }
                }
            }S
            ystem.out.println(min != 100010 ? min : -1);
        }
    }
}
